5 research outputs found
Asymptotic Expansions for the Sojourn Time Distribution in the -PS Queue
We consider the queue with a processor sharing server. We study the
conditional sojourn time distribution, conditioned on the customer's service
requirement, as well as the unconditional distribution, in various asymptotic
limits. These include large time and/or large service request, and heavy
traffic, where the arrival rate is only slightly less than the service rate.
Our results demonstrate the possible tail behaviors of the unconditional
distribution, which was previously known in the cases and (where it
is purely exponential). We assume that the service density decays at least
exponentially fast. We use various methods for the asymptotic expansion of
integrals, such as the Laplace and saddle point methods.Comment: 45 page
Moment-Generating Algorithm for Response Time in Processor Sharing Queueing Systems
Response times are arguably the most representative and important metric for measuring the performance of modern computer systems. Further, service level agreements (SLAs), ranging from data centres to smartphone users, demand quick and, equally important, predictable response times. Hence, it is necessary to calculate moments, at least, and ideally response time distributions, which is not straightforward. A new moment-generating algorithm for calculating response times analytically is obtained, based on M/M/1 processor sharing (PS) queueing models. This algorithm is compared against existing work on response times in M/M/1-PS queues and extended to M/M/1 discriminatory PS queues. Two real-world case studies are evaluated